A Characterization of Generically Rigid Frameworks on Surfaces of Revolution
نویسندگان
چکیده
A foundational theorem of Laman provides a counting characterisation of the finite simple graphs whose generic bar-joint frameworks in two dimensions are infinitesimally rigid. Recently a Laman-type characterisation was obtained for frameworks in three dimensions whose vertices are constrained to concentric spheres or to concentric cylinders. Noting that the plane and the sphere have 3 independent locally tangential infinitesimal motions while the cylinder has 2, we obtain here a Laman-type theorem for frameworks on algebraic surfaces with a 1-dimensional space of tangential motions. Such surfaces include the torus, helicoids and surfaces of revolution. The relevant class of graphs are the (2, 1)-tight graphs, in contrast to (2, 3)-tightness for the plane/sphere and (2, 2)-tightness for the cylinder. The proof uses a new characterisation of simple (2, 1)-tight graphs and an inductive construction requiring generic rigidity preservation for 5 graph moves, including the two Henneberg moves, an edge joining move and various vertex surgery moves.
منابع مشابه
Combining Globally Rigid Frameworks
Here it is shown how to combine two generically globally rigid bar frameworks in d-space to get another generically globally rigid framework. The construction is to identify d+1 vertices from each of the frameworks and erase one of the edges that they have in common.
متن کاملSparse hypergraphs with applications in combinatorial rigidity
A hypergraph H = (V,E) is called (1, k)-sparse, for some integer k, if each subset X ⊆ V with |X| ≥ k spans at most |X| − k hyperedges. If we also have |E| = |V | − k then H is (1, k)-tight. Hypergraphs of this kind occur in several problems of combinatorial rigidity, where the goal is to analyse the generic rigidity properties of point sets equipped with geometric constraints involving subsets...
متن کاملA Constructive Characterisation of Circuits in the Simple (2,2)-sparsity Matroid
We provide a constructive characterisation of circuits in the simple (2, 2)sparsity matroid. A circuit is a simple graph G = (V,E) with |E| = 2|V | − 1 and the number of edges induced by any X ( V is at most 2|X| − 2. Insisting on simplicity results in the Henneberg operation being enough only when the graph is sufficiently connected. Thus we introduce 3 different sum operations to complete the...
متن کاملIsostatic Block and Hole Frameworks
A longstanding problem in rigidity theory is to characterize the graphs which are minimally generically rigid in 3-space. The results of Cauchy, Dehn, and Alexandrov give one important class: the triangulated convex spheres, but there is an ongoing desire for further classes. We provide such a class, along with methods to verify generic rigidity that can be extended to other classes. These meth...
متن کاملStudying the Theoretical Frameworks of Seminary currents' Stance about the Islamic Revolution (1962-1979)
To analyze seminary currents' stance from 1960s till the victory of Islamic revolution, a different theoretical framework can be put forward. Western writers often speak of three currents: "completely political", "moderate" and "radical". Some internal writers mention three currents;"conservative and nonpolitical","moderate" and "revolutionary".According to most Shiite jurisprudents' who consid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Discrete Math.
دوره 28 شماره
صفحات -
تاریخ انتشار 2014